Search results for "discrete [space-time]"
showing 10 items of 2035 documents
Subpixel determination of imperfect circles characteristics
2008
This article deals with the problem of the determination of characteristics of imperfect circular objects in discrete images, namely the radius and center coordinates. To limit distortion, a multi-level method based on active contours was developed. Its originality is to furnish a set of geometric envelopes in one pass, with a correspondence between grayscale and a regularity scale. The adequacy of this approach was tested with several methods, among them is the Radon-based method. More particularly, this study indicates the relevance of the use of active contours combined with a Radon transform-based method which was improved using a fitting considering the discrete implementation of the R…
A Formal Semantics and a Client Synthesis for a BPEL Service
2008
A complex Web service described with languages like BPEL4WS, consists of an executable process and its observable behaviour (called an abstract process) based on the messages exchanged with the client. The abstract process behaviour is non deterministic due to the internal choices during the service execution. Furthermore the specification often includes timing constraints which must be taken into account by the client. Thus given a service specification, we identify the synthesis of a client as a key issue for the development of Web services. To this end, we propose an approach based on (dense) timed automata to first describe the observable service behaviour and then to build correct inte…
Iterative pairs and multitape automata
1996
In this paper we prove that if every iterative k-tuple of a language L recognized by a k-tape automaton is very degenerate, then L is recognizable. Moreover, we prove that if L is an aperiodic langnage recognized by a deterministic k-tape automaton, then L is recognizable.
Percolation on correlated random networks
2011
We consider a class of random, weighted networks, obtained through a redefinition of patterns in an Hopfield-like model and, by performing percolation processes, we get information about topology and resilience properties of the networks themselves. Given the weighted nature of the graphs, different kinds of bond percolation can be studied: stochastic (deleting links randomly) and deterministic (deleting links based on rank weights), each mimicking a different physical process. The evolution of the network is accordingly different, as evidenced by the behavior of the largest component size and of the distribution of cluster sizes. In particular, we can derive that weak ties are crucial in o…
Organization and evolution of synthetic idiotypic networks
2012
We introduce a class of weighted graphs whose properties are meant to mimic the topological features of idiotypic networks, namely the interaction networks involving the B-core of the immune system. Each node is endowed with a bit-string representing the idiotypic specificity of the corresponding B cell and a proper distance between any couple of bit-strings provides the coupling strength between the two nodes. We show that a biased distribution of the entries in bit-strings can yield fringes in the (weighted) degree distribution, small-worlds features, and scaling laws, in agreement with experimental findings. We also investigate the role of ageing, thought of as a progressive increase in …
Discrete-Time Adaptive Hysteresis Filter for Parallel Computing and Recursive Identification of Preisach Model
2018
High-precision motion control systems, for instance deployed for micro- and nano-positioning, often use the smart-material based actuators such as piezoelectric and magnetostrictive stages. Those exhibit inherent hysteresis nonlinearities which are challenging to compensate without precise hysteresis modeling. Even if a suitable hysteresis modeling approach is available, its parameter identification, correspondingly adaptation, at normal operating conditions constitute an essential task for the overall control design. This paper uses the direct recursive identification method for the Preisach hysteresis model and describes the fast parallel-computing discrete-time algorithm for an adaptive …
From Lattice Valued Theories to Lattice Valued Analysis
2015
We claim and justify that the future of a fuzzy logic is in the interconnection of various well-developed theories. We are focused on a lattice valued analysis that unifies the treatments of atomic elements, sets of atomic elements, functions between sets of atomic elements and their properties. We clarify the relationship between a fuzzy function and its ordinary core. We discuss the property of continuity of a fuzzy function in a lattice valued topology.
2-Groups with few rational conjugacy classes
2011
Abstract In this paper we prove the following conjecture of G. Navarro: if G is a finite 2-group with exactly 5 rational conjugacy classes, then G is dihedral, semidihedral or generalized quaternion. We also characterize the 2-groups with 4 rational classes.
A PARALLEL ALGORITHM FOR ANALYZING CONNECTED COMPONENTS IN BINARY IMAGES
1992
In this paper, a parallel algorithm for analyzing connected components in binary images is described. It is based on the extension of the Cylindrical Algebraic Decomposition (CAD) to a two-dimensional (2D) discrete space. This extension allows us to find the number of connected components, to determine their connectivity degree, and to solve the visibility problem. The parallel implementation of the algorithm is outlined and its time/space complexity is given.
The Kuratowski convergence and connected components
2012
International audience; We investigate the Kuratowski convergence of the connected components of the sections of a definable set applying the result obtained to semialgebraic approximation of subanalytic sets. We are led to some considerations concerning the connectedness of the limit set in general. We discuss also the behaviour of the dimension of converging sections and prove some general facts about the Kuratowski convergence in tame geometry.